Deterministic finite automata characterization and optimization for scalable pattern matching
نویسندگان
چکیده
منابع مشابه
OFA: A Scalable Finite Automata-based Pattern- Matching Engine for Out-of-Order Deep Packet Inspection
To match the signatures of malicious traffic across packet boundaries, network-intrusion detection (and prevention) systems (NIDS) typically perform pattern matching after flow reassembly or packet reordering. However, this may lead to the need for large packet buffers, making detection vulnerable to denial-of-service (DoS) attacks, whereby attackers exhaust the buffer capacity by sending long ...
متن کاملOn Regular Expression Matching and Deterministic Finite Automata
Given a regular expression R and a string T the regular expression matching problem is to determine if T matches any string in the language generated by R. The best known solution to the problem uses linear space and O ( nm log logn log3/2 n +n+m ) time in the worst-case [2], where m and n are the lengths of R and T , respectively. A common misconception is that we can solve the problem efficie...
متن کاملFailure Deterministic Finite Automata
Inspired by failure functions found in classical pattern matching algorithms, a failure deterministic finite automaton (FDFA) is defined as a formalism to recognise a regular language. An algorithm, based on formal concept analysis, is proposed for deriving from a given deterministic finite automaton (DFA) a language-equivalent FDFA. The FDFA’s transition diagram has fewer arcs than that of the...
متن کاملType-based Semantic Optimization for Scalable RDF Graph Pattern Matching
Scalable query processing relies on early and aggressive determination and pruning of query-irrelevant data. Besides the traditional space-pruning techniques such as indexing, type-based optimizations that exploit integrity constraints defined on the types can be used to rewrite queries into more efficient ones. However, such optimizations are only applicable in strongly-typed data and query mo...
متن کاملOn Two-Dimensional Pattern Matching by Finite Automata
This paper presents a general concept of two-dimensional pattern matching using conventional (one-dimensional) finite automata. Then two particular models and methods, implementations of the general principle, are presented. The first of these two models presents an automata based version of the Bird and Baker approach with lower space complexity than the original algorithm. The second introduc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Architecture and Code Optimization
سال: 2011
ISSN: 1544-3566,1544-3973
DOI: 10.1145/1952998.1953002